Shape Matching via Quotient Spaces

Shape matching and moduli spaces

Shape matching represents a challenging problem in both information engineering and computer science, exhibiting not only a wide spectrum of multimedia applications, but also a deep relation with conformal geometry. After reviewing the theoretical foundations and the practical issues involved in this fashinating subject, we focus on two state-of-the-art approaches relying respectively on local ...

ε-weakly Chebyshev subspaces and quotient spaces

Norms on Quotient Spaces

Best Coapproximation in Quotient Spaces

As a counterpart to best approximation, a new kind of approximation, called best coapproximation was introduced in normed linear spaces by C. Franchetti and M. Furi. In this paper, we use this coapproximation to prove some results on the existence and uniqueness of best coapproximation in quotient spaces when the underlying spaces are metric linear spaces. We shall also see how coproximinality ...

Efficient Shape Matching Via Graph Cuts

Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determine an optimal correspondence is a computationally challenging combinatorial problem. Traditionally it has been formulated as a shortest path problem which can be solved efficiently by Dynamic Time Warping. In this paper, we sho...